Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times

This paper considers the minimization of makespan in unrelated parallel batch processing machines scheduling problem with considering non-identical job size and dynamic ready time. The considered have different capacity speed. Each machine processes a number jobs as at same time so that machine’s is not exceeded. are equal to largest batch, respectively. In this paper, Mixed Integer Linear Programming (MILP) model, two categories heuristic procedures (six heuristics) meta-heuristic algorithm proposed solve problem. A lower bound also presented by relaxing original evaluate quality algorithms. computational experiments show performance algorithms under measures.